package com.hfb.mashibing.alip8.diamondsquarealgorithm.class10;

import java.util.ArrayList;
import java.util.List;

/**
 * 点杰哥的通用描述
 * @param <V>
 */
public class Node {
    // 点上的值,编号
    public int value;
    // 点的入度
    public int in;
    // 点的出度
    public int out;
    // 点的直接邻居
    public List<Node> nexts;
    // 点的边
    public List<Edge> edges;

    public Node(int data) {
        this.value = data;
        this.in = 0;
        this.out = 0;
        nexts = new ArrayList<>();
        edges = new ArrayList<>();

    }

}
